Regular expressions into finite automata
نویسندگان
چکیده
منابع مشابه
Regular Expressions into Finite Automata
It is a well-established fact that each regular expression can be transformed into a non-deterministic nite automaton (NFA) with or without-transitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi 4] have shown that the construction of an-free NFA due to Glushkov 10] is a natural representation of the regular expression, because it can be des...
متن کاملTranslating Regular Expressions into Small -Free Nondeterministic Finite Automata
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic nite automaton (NFA) of size O(n(log n) 2) in polynomial time. The best previous conversions result in NFAs of worst case size (n 2). Moreover, the nonexistence of any linear conversion is proved: we give a language Ln described by a regular expression of size O(n) such that every NFA accep...
متن کاملEmbedding Finite Automata within regular Expressions
Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure of regular expression based formulas, as well as of many LTL and CTL formulas, involves constructing an automaton which runs in parallel with the model. In this paper we re-examine this construction. Instead of directly transla...
متن کاملProvably Shorter Regular Expressions from Finite Automata
A famous theorem due to Kleene [25] states that the regular languages admit two equivalent characterizations of entirely different nature, namely as the languages accepted by finite automata on the one hand, and as those described by regular expressions on the other hand. There are a few classical algorithms for converting finite automata into regular expressions. Those algorithms look differen...
متن کاملRegular Expressions From Deterministic Finite Automata, Revisited
We continue our research on the conversion of deterministic finite automata to equivalent regular expressions from [H. Gruber, M. Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. In: 12th DLT, Number 5257 of LNCS, 2008], where it was shown that every language over a binary alphabet accepted by an n-state deterministic finite automaton can be converted into an equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90287-4